Quicksort and Sorting Lower Bounds Parallel and Sequential Data Structures and Algorithms , 15 - 210 ( Fall 2012 )
نویسنده
چکیده
Quicksort is one of the earliest and most famous algorithms. It was invented and analyzed by Tony Hoare around 1960. This was before the big-O notation was used to analyze algorithms. Hoare invented the algorithm while an exchange student at Moscow State University while studying probability under Kolmogorov—one of the most famous researchers in probability theory. The analysis we will cover is different from what Hoare used in his original paper, although we will mention how he did the analysis.
منابع مشابه
Quicksort and Sorting Lower Bounds Parallel and Sequential Data
Quicksort is one of the earliest and most famous algorithms. It was invented and analyzed by Tony Hoare around 1960. This was before the big-O notation was used to analyze algorithms. Hoare invented the algorithm while an exchange student at Moscow State University while studying probability under Kolmogorov—one of the most famous researchers in probability theory. The analysis we will cover is...
متن کاملHardware-Aware Algorithms and Data Structures
Various computer hardware components are affecting the running time of algorithms in different proportions, or may have severe implications on the accuracy of algorithms. In this dissertation we propose algorithms and data structures that are efficient and robust with respect to different hardware factors. The hardware factors affecting the running time that we consider include branch mispredic...
متن کاملScalability of Parallel Sorting on Mesh Multicomputers
This paper presents two new parallel algorithms QSP1 and QSP2 based on sequential quicksort for sorting data on a mesh multicomputer, and analyzes their scalability using the isoeeciency metric. We show that QSP2 matches the lower bound on the isoee-ciency function for mesh multicomputers. The isoef-ciency of QSP1 is also fairly close to optimal. Lang et al. and Schnorr et al. have developed pa...
متن کاملFast Sorting on the Sequent
We develop a series of quicksort algorithms for the Sequent Symmetry shared memory parallel computer. By employing a novel yet simple parallel splitting algorithm and dynamic scheduling we are able to achieve a speedup of 13 with 16 processors over the performance of sequential quicksort on one processor. This work provides experimental evidence that asynchronous algorithms’ more uniform usage ...
متن کاملA Message Passing Implementation of a New Parallel Arrangement Algorithm
This paper describes a new algorithm of arrangement in parallel, based on Odd-Even Mergesort, called division and concurrent mixes. The main idea of the algorithm is to achieve that each processor uses a sequential algorithm for ordering a part of the vector, and after that, for making the processors work in pairs in order to mix two of these sections ordered in a greater one, also ordered; aft...
متن کامل